Model checking quantum Markov chains
نویسندگان
چکیده
Article history: Received 10 May 2012 Received in revised form 28 November 2012 Accepted 22 April 2013 Available online 25 April 2013
منابع مشابه
Model Checking ω-regular Properties for Quantum Markov Chains∗
Quantum Markov chains are an extension of classical Markov chains which are labelled with super-operators rather than probabilities. They allow to faithfully represent quantum programs and quantum protocols. In this paper, we investigate model checking ω-regular properties, a very general class of properties (including, e.g., LTL properties) of interest, against this model. For classical Markov...
متن کاملQuantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
In this paper, we study a model of quantum Markov chains that is a quantum analogue of Markov chains and is obtained by replacing probabilities in transition matrices with quantum operations. We show that this model is very suited to describe hybrid systems that consist of a quantum component and a classical one, although it has the same expressive power as another quantum Markov model proposed...
متن کاملModel Checking of Open Interval Markov Chains
We consider the model checking problem for interval Markov chains with open intervals. Interval Markov chains are generalizations of discrete time Markov chains where the transition probabilities are intervals, instead of constant values. We focus on the case where the intervals are open. At first sight, open intervals present technical challenges, as optimal (min, max) value for reachability m...
متن کاملModel-Checking Markov Chains in the Presence of Uncertainties
We investigate the problem of model checking Interval-valued Discrete-time Markov Chains (IDTMC). IDTMCs are discrete-time finite Markov Chains for which the exact transition probabilities are not known. Instead in IDTMCs, each transition is associated with an interval in which the actual transition probability must lie. We consider two semantic interpretations for the uncertainty in the transi...
متن کاملModel Checking by Censoring Markov Chains and Stochastic Comparison
We study how to combine the censoring technique for Markov chains and the strong stochastic comparison to perform model checking of discrete-time Markov chains. Our goal is to reduce the complexity of the model checking in order to be able to consider numerically intractable models. In model checking we do not need the exact values but we must decide if the required guarantees are satisfied or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 79 شماره
صفحات -
تاریخ انتشار 2013